An approach for overlapping and hierarchical community detection in social networks based on coalition formation game theory
نویسندگان
چکیده
With greater availability of data and increasing interaction activities taking place on social media, detecting overlapping and hierarchical communities has become an important issue and one that is essential to social media analysis. In this paper, we propose a coalition formation game theory-based approach to identify overlapping and hierarchical communities. We model community detection as a coalition formation game in which individuals in a social network are modelled as rational players aiming to improve the group’s utilities by cooperating with other players to form coalitions. Each player is allowed to join multiple coalitions, and those coalitions with fewer players can merge into a larger coalition as long as the merge operation is beneficial to the utilities of the merged coalitions, thus overlapping and hierarchical communities can be revealed simultaneously. The utility function of each coalition is defined as the combination of a gain function and a cost function. The gain function measures the degree of interactions amongst the players inside a coalition, while the cost function instead represents the degree of the interactions between the players of the coalition and the rest of the network. As game theory provides a formal analytical framework with a set of mathematical tools to study the complex interactions among rational players, applying game theory for detecting communities helps to identify communities more rationally. Some desirable properties of the utility function, such as the non-resolution limit and the non-scaling behavior, have been examined theoretically. To solve the issue of pre-setting the number and size for communities and to improve the efficiency of the detection process, we have developed a greedy agglomerative manner to identify communities. Extensive experiments have been conducted on synthetic and real networks to evaluate the effectiveness and efficiency of the proposed approach which can be applied for real world
منابع مشابه
Overlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملChanges in a Service Oriented Enterprise: A Game Theory Approach
Service Oriented Enterprises (SOEs) are subject to constant change and variation. In this paper, the changes are considered from an economic perspective based on service culture notion. Once a change is implemented, the costs of some member services may increase, whereas the costs of some other services may reduce. We construct a game theoretic model trying to capture the possible conflicting i...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 42 شماره
صفحات -
تاریخ انتشار 2015